Broadcast Data Placement over Multiple Wireless Channels
نویسندگان
چکیده
The advances in computer and communication technologies made possible an ubiquitous computing environment were clients equipped with portable devices can send and receive data anytime and from anyplace. Due to the asymmetry in communication and the scarceness of wireless resources, data broadcast is widely employed as an effective means in delivering data to the mobile clients. For reasons like heterogeneous communication capabilities and variable quality of service offerings, we may need to divide a single wireless channel into multiple physical or logical channels. Thus, we need efficient algorithms for placing the broadcast data into these multiple channels so as to reduce the client access time. The present chapter discusses algorithms for placing broadcast data to multiple wireless channels, which cannot be 156 Katsaros & Manolopoulos Copyright © 2005, Idea Group Inc. Copying or distributing in print or electronic forms without written permission of Idea Group Inc. is prohibited. coalesced into a lesser number of high-bandwidth channels, assuming that there are no dependencies among the transmitted data. We give an algorithm for obtaining the optimal placement to the channels and explain its limitation since it is computationally very demanding and thus unfeasible. Then, we present heuristic schemes for obtaining suboptimal solutions to the problem of reporting on their implementation cost and their relative performance.
منابع مشابه
An Efficient XML Data Placement Scheme over Multiple Wireless Broadcast Channels
In this paper, we propose an XML data placement scheme by optimally partitioning XML data among multiple broadcast channels in such a way that it minimizes the average response time of mobile clients in processing of different XML queries. By performing several experiments, we have shown that our proposed XML data placement scheme improves the performance of XML query processing of mobile clien...
متن کاملA Data Allocation Method over Multiple Wireless Broadcast Channels
In this paper, we concentrate on data allocation methods for multiple wireless broadcast channels to reduce the average data access time. Existing works first sorted data by their access probabilities and allocate the partitions of the sorted data to the multiple wireless channels. They employ the Flat broadcast schedule for each channel to cyclically broadcast all the data items allocated to i...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملA Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملIncorporating Global Index with Data Placement Scheme for Multi Channels Mobile Broadcast Environment
A scalable information delivery services like data broadcasting scheme is definitely of great interest especially to deal with the exponential increase of mobile users. In this paper, we present Global Indexing with data placement scheme for multi broadcast channels environment, which aims to minimize query access time, tuning time and power consumption. This scheme considers index and data all...
متن کامل